Routing and Broadcasting on Incomplete and Gray Code Incomplete Hypercubes
نویسنده
چکیده
We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal distance paths between any two nodes. We then introduce a new model of computation, Gray code incomplete hypercube (GCIH), which is an interval of nodes of hypercube in Gray code ordel, and obtain similar results for the new model.
منابع مشابه
A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes
An incomplete hypercube possesses virtually every advantage of complete hypercubes, including simple deadlock-free routing, a small diameter, bounded link traffic density, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty hypercube into a maximum incomplete cube so as to lower potential performance degradation, because a hypercube so reconfigured often resu...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملTopology and Routing Algorithm Based on the Combination Gray Code with Johnson Code
Hypercubes utilizing Gray Code are used widely as the interconnection networks of parallel computer systems. But an n-dimensional hypercube has 2n nodes, when the size of a network have been increases added nodes must be 2i times more than its nodes and increase the degree of nodes , which affects scalable characteristic. The paper puts forward a scalable hypercube based on the Combination Gray...
متن کاملImproved Probabilistic Routing on Generalized Hypercubes
p. 1 Efficient Data Communication in Incomplete Hypercubes p. 13 Efficient Communication in the Folded Petersen Interconnection Networks p. 25 Compiling Rewriting onto SIMD and MIMD/SIMD Machines p. 37 A Compilation Technique for Varying Communication Cost NUMA Architectures p. 49 A Data Partitioning Algorithm for Distributed Memory Compilation p. 61 Towards a High Precision Massively Parallel ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Algorithms Appl.
دوره 1 شماره
صفحات -
تاریخ انتشار 1993